Oriented graphs of diameter 2
نویسندگان
چکیده
Let f(n) be the minimum number of arcs among oriented graphs of order n and diameter 2. Here it is shown for n > 8 that (1−o(1))nlog2n ≤ f(n) ≤ nlog2n− (3/2)n. ∗1991 Mathematics Subject Classification. Primary 05C20, 05C35, 05C15; Secondary 05D99
منابع مشابه
New skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملComplexity of approximating the oriented diameter of chordal graphs
The oriented diameter of a bridgeless connected undirected (bcu ) graph G is the smallest diameter among all the diameters of strongly connected orientations of G. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We (a) construct a linear-time approximation algorithm that, for a given chordal bcu graph G, finds a strongly connected orientation of G with diam...
متن کاملRainbow connection in oriented graphs
An edge-coloured graph G is said to be rainbow-connected if any two vertices are connected by a path whose edges have different colours. The rainbow connection number of a graph is the minimum number of colours needed to make the graph rainbow-connected. This graph parameter was introduced by G. Chartrand, G.L. Johns, K.A. McKeon and P. Zhang in 2008. Since, the topic drew much attention, and v...
متن کاملNote on rainbow connection in oriented graphs with diameter 2
In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament T of diameter 2, we show 2 ≤ − →rc(T ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow k-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of kth diameter 2 has rainbow k-co...
متن کاملSeparating systems and oriented graphs of diameter two
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and Szemerédi [6], who proved that the minimal number of edges in an oriented graph of order n with diameter 2 is at least (n/2) log2(n/2). We show that the minimum is (1 + o(1))n log2 n.
متن کامل